Computations of Cyclotomic Lattices
نویسندگان
چکیده
We study even modular lattices of leveì and dimension 2(p ? 1), p prime, which arise from the ideal class group of the p-th cyclotomic extension of Q(p ?`). After giving the basic theory we concentrate on Galois-invariant ideals , obtain computational results on minimal vectors and isometries, and identify several old or new extremal lattices.
منابع مشابه
Polynomial time reduction from approximate shortest vector problem to the principle ideal porblem for lattices in cyclotomic rings
Many cryptographic schemes have been established based on the hardness of lattice problems. For the asymptotic efficiency, ideal lattices in the ring of cyclotomic integers are suggested to be used in most such schemes. On the other hand in computational algebraic number theory one of the main problem is called principle ideal problem (PIP). Its goal is to find a generators of any principle ide...
متن کاملPolynomial Time Reduction from Approximate Shortest Vector Problem to Principal Ideal Problem for Lattices in Some Cyclotomic Rings
Many cryptographic schemes have been established based on the hardness of lattice problems. For the asymptotic efficiency, ideal lattices in the ring of cyclotomic integers are suggested to be used in most such schemes. On the other hand in computational algebraic number theory one of the main problem is the principal ideal problem (PIP). Its goal is to find a generator of any principal ideal i...
متن کاملCyclotomic Polytopes and Growth Series of Cyclotomic Lattices
The coordination sequence of a lattice L encodes the word-length function with respect toM , a set that generates L as a monoid. We investigate the coordination sequence of the cyclotomic lattice L = Z[ζm], where ζm is a primitive m th root of unity and where M is the set of all m roots of unity. We prove several conjectures by Parker regarding the structure of the rational generating function ...
متن کاملOn automorphisms of extremal even unimodular lattices
The automorphism groups of the three known extremal even unimodular lattices of dimension 48 and the one of dimension 72 are determined using the classification of finite simple groups. Restrictions on the possible automorphisms of 48-dimensional extremal lattices are obtained. We classify all extremal lattices of dimension 48 having an automorphism of order m with φ(m) > 24. In particular the ...
متن کاملProvably Secure NTRUEncrypt over More General Cyclotomic Rings
NTRUEncrypt is a fast and standardized lattice-based public key encryption scheme, but it lacks a solid security guarantee. In 2011, Stehlé and Steinfeld first proposed a provably secure variant of NTRUEncrypt, denoted by pNE, over power-of-2 cyclotomic rings. The IND-CPA security of pNE is based on the worst-case quantum hardness of classical problems over ideal lattices. Recently, Yu, Xu and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Experimental Mathematics
دوره 4 شماره
صفحات -
تاریخ انتشار 1995